Understanding the Semantics of Keyword Queries on Relational Data Without Accessing the Instance
نویسندگان
چکیده
The simplicity of keyword queries has made them particularly attractive to the technically unskilled user base, tending to become the de-facto standard for querying on the web. Unfortunatelly, alongside its simplicity, came also the loose semantics. Researchers have for a long time studied ways to understand the keyword query semantics and retrieve the most relevant data artifacts. For the web, these artifacts were documents, thus, any semantics discovering effort was based mainly on statistics about the appearance of the keywords in the documents. Recently, there has been an increasing interest in publishing structural data on the web, allowing users to exploit valuable resources that have so far been kept private within companies and organizations. These sources support only structural queries. If they are to become available on the web and be queried, the queries will be in the form of keywords and they will have to be translated into structured queries in order to be executed. Existing works have exploited the instance data in order to build offline an index that is used at query time to drive the translation. This idea is not always possible to implement since the owner of the data source is typically not willing to allow unrestricted access to the data, or to offer resources for the index construction. Sonia Bergamaschi DII-UNIMORE, via Vignolese 905 Modena, IT e-mail: [email protected] Elton Domnori DII-UNIMORE, via Vignolese 905, Modena, Italy e-mail: [email protected] Francesco Guerra DEA-UNIMORE, v.le Berengario 51, Modena, Italy e-mail: francesco.guerra@unimore.
منابع مشابه
Data Extraction from Structured Databases using Keyword-based Queries
Relational databases are used to store a large quantity of data scattered around the world. However, users face difficulties in accessing such data for lack of a more natural way of specifying queries. Techniques that use natural language words to search different information sources on the Web are now very common, but they cannot be employed to search relational databases. This work proposes a...
متن کاملAnswering Keyword Queries involving Aggregates and GROUPBY on Relational Databases
Keyword search over relational databases has gained popularity as it provides a user-friendly way to explore structured data. Current research in keyword search has largely ignored queries to retrieve statistical information from the database. The work in [13] extends keywords by supporting aggregate functions in their SQAK system. However, SQAK does not consider the semantics of objects and re...
متن کاملPowerQ: An Interactive Keyword Search Engine for Aggregate Queries on Relational Databases
Keyword search over relational databases has gained popularity due to its ease of use. Current research has focused on the efficient computation of results from multiple tuples, and largely ignores queries to retrieve statistical information from databases. The work in [5] developed a system that allows aggregate functions to be expressed using simple keywords. However, this system may return i...
متن کاملA Hidden Markov Model Approach to Keyword-Based Search over Relational Databases
We present a novel method for translating keyword queries over relational databases into SQL queries with the same intended semantic meaning. In contrast to the majority of the existing keyword-based techniques, our approach does not require any a-priori knowledge of the data instance. It follows a probabilistic approach based on a Hidden Markov Model for computing the top-K best mappings of th...
متن کاملApply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کامل